Necessary optimality conditions for constrained optimization problems under relaxed constraint qualifications
نویسندگان
چکیده
We derive firstand second-order necessary optimality conditions for set-constrained optimization problems under the constraint qualificationtype conditions significantly weaker than Robinson’s constraint qualification. Our development relies on the so-called 2-regularity concept, and unifies and extends the previous studies based on this concept. Specifically, in our setting constraints are given by an inclusion, with an arbitrary closed convex set on the right-hand side. Thus, for the second-order analysis, some curvature characterizations of this set near the reference point must be taken into account.
منابع مشابه
Mathematical Programms with Equilibrium Constraints: A sequential optimality condition, new constraint qualifications
Mathematical programs with equilibrium (or complementarity) constraints, MPECs for short, is a difficult class of constrained optimization problems. The feasible set has a very special structure and violates most of the standard constraint qualifications (CQs). Thus, the standard KKT conditions are not necessary satisfied by minimizers and the convergence assumptions of many standard methods fo...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملTwo-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, we derive formula for estimating the subdifferential of its valued function. Finally, we present some necessary optimality condit...
متن کاملConstraint qualifications and optimality conditions for optimization problems with cardinality constraints
This paper considers optimization problems with cardinality constraints. Based on a recently introduced reformulation of this problem as a nonlinear program with continuous variables, we first define some problem-tailored constraint qualifications and then show how these constraint qualifications can be used to obtain suitable optimality conditions for cardinality constrained problems. Here, th...
متن کاملMangasarian-Fromovitz and Zangwill Conditions For Non-Smooth Infinite Optimization problems in Banach Spaces
In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are Lipschitz near the optimal solution. Necessary optimality conditions and constraint qualifications in terms of Michel-Penot subdifferential are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 114 شماره
صفحات -
تاریخ انتشار 2008